Triangle-factors in a balanced blown-up triangle
نویسندگان
چکیده
منابع مشابه
Triangle-factors in a balanced blown-up triangle
Let G be a 3-partite graph with 3n vertices, n in each class, such that each vertex is connected to at least 2 3 n+ 2 √ n of the vertices in each of the other two classes. We prove that G contains n independent triangles.
متن کاملA Triangle-Triangle Intersection Algorithm
The intersection between 3D objects plays a prominent role in spatial reasoning, geometric modeling and computer vision. Detection of possible intersection between objects can be based on the objects’ triangulated boundaries, leading to computing triangle-triangle intersection. Traditionally there are separate algorithms for cross intersection and coplanar intersection. There is no single algor...
متن کاملTriangle factors in random graphs
A triangle factor of a graph G = (V,E) on n = |V | = 3k vertices, is a subgraph of G consisting of k vertex-disjoint triangles. A result by Krivelevich [9] states that a triangle factor exists in the random graph G(n, p), n = 3k, with probability 1− o(1) if p = Ω(n−2/3+1/15). This was further improved by Jeong Han Kim in [7] to p = ω(n−2/3+1/18). In this paper we improve this to p = n−2/3+o(1)....
متن کاملTriangle Factors in Random Graphs
For a graph G = (V; E) on n vertices, where 3 divides n, a triangle factor is a subgraph of G, consisting of n=3 vertex disjoint triangles (complete graphs on three vertices). We discuss the problem of determining the minimal probability p = p(n), for which a random graph G 2 G(n; p) contains almost surely a triangle factor. This problem (in a more general setting) has been studied by Alon and ...
متن کاملMaximal sets of triangle- factors
A collection of edge-disjoint triangle-factors on K3n is called maximal if it cannot be extended by a further triangle-factor. It is well-known that a maximal set must therefore contain at least % triangle factors. We consider the following question: for which k with % :::; k :::; (3n;1) is there a maximal set of k trianglefactors on K3n?
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2000
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00324-6